On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
نویسندگان
چکیده
منابع مشابه
Seidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملOn the sum of signless Laplacian eigenvalues of a graph
For a simple graph G, let e(G) denote the number of edges and Sk(G) denote the sum of the k largest eigenvalues of the signless Laplacian matrix of G. We conjecture that for any graph G with n vertices, Sk(G) ≤ e(G) + k+1 2 for k = 1, . . . , n. We prove the conjecture for k = 2 for any graph, and for all k for regular graphs. The conjecture is an analogous to a conjecture by A.E. Brouwer with ...
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کاملA relation between the Laplacian and signless Laplacian eigenvalues of a graph
Let G be a graph of order n such that ∑n i=0(−1)iaiλn−i and ∑n i=0(−1)ibiλn−i are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that ai ≥ bi for i = 0,1, . . . , n. As a consequence, we prove that for any α, 0 < α ≤ 1, if q1, . . . , qn and μ1, . . . ,μn are the signless Laplacian and the Laplacian eigenvalues of G, respectively,...
متن کاملLaplacian Sum-Eccentricity Energy of a Graph
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2013
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-013-0048-7